Weapon-Target Assignment for Multi-to-Multi Interception With Grouping Constraint

The Weapon-Target Assignment Problem

Improved assignment with ant colony optimization for multi-target tracking

Detecting and tracking ground targets is crucial in military intelligence in battlefield surveillance. Once targets have been detected, the system used can proceed to track them where tracking can be done using Ground Moving Target Indicator (GMTI) type indicators that can observe objects moving in the area of interest. However, when targets move close to each other in formation as a convoy, th...

Distributed Simultaneous Action and Target Assignment for Multi-Robot Multi-Target Tracking

We study a multi-robot assignment problem for multi-target tracking. The proposed problem can be viewed as the mixed packing and covering problem. To deal with a limitation on both sensing and communication ranges, a distributed approach is taken into consideration. A local algorithm gives theoretical bounds on both the running time and approximation ratio to an optimal solution. We employ a lo...

Efficient Heuristic Approach to the Weapon-Target Assignment Problem

The Weapon Target Assignment (WTA) problem is a fundamental defense application of operations research. The problem consists of optimally assigning a given number of weapons to a set of targets so that the post-engagement total expected survival value of the targets is minimized. Since the WTA problem is known to be NP-complete, there are no exact methods to solve it. This paper presents two in...

Exact and Heuristic Methods for the Weapon Target Assignment Problem

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...